Magic Squares, Rook Polynomials and Permutations
نویسنده
چکیده
We study in this paper the set of magic squares and their relation with some restricted permutations. Résumé. Nous étudions dans cet article l’ensemble des carrés magiques et leur relation avec des permutations spéciales.
منابع مشابه
Generalized Rook Polynomials
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are established with absolute Stirling numbers and permutations, Bessel polynomials, matchings, multiset permutations, hypergeometric functions, Abel polynomials and forests, and polynomial sequences of binomial type. Factorization and recipro...
متن کاملA Block Decomposition Algorithm for Computing Rook Polynomials
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. [13] In this paper, we give a new decomposition theorem, which yields a more efficient algorithm for computing the rook polynomial. We show that, in the worst case, this block decomposition ...
متن کاملStaircase rook polynomials and Cayley's game of Mousetrap
First introduced by Arthur Cayley in the 1850’s, the game of Mousetrap involves removing cards from a deck according to a certain rule. In this paper we find the rook polynomial for the number of Mousetrap decks in which at least two specified cards are removed. We also find a new expression for the rook polynomial for the number of decks in which exactly one specified card is removed and give ...
متن کاملBruhat intervals as rooks on skew Ferrers boards
We characterise the permutations π such that the elements in the closed lower Bruhat interval [id, π] of the symmetric group correspond to nontaking rook configurations on a skew Ferrers board. It turns out that these are exactly the permutations π such that [id, π] corresponds to a flag manifold defined by inclusions, studied by Gasharov and Reiner. Our characterisation connects the Poincaré p...
متن کاملThe Inverse Rook Problem on Ferrers Boards
Rook polynomials have been studied extensively since 1946, principally as a method for enumerating restricted permutations. However, they have also been shown to have many fruitful connections with other areas of mathematics, including graph theory, hypergeometric series, and algebraic geometry. It is known that the rook polynomial of any board can be computed recursively. [19, 18] The naturall...
متن کامل